Permutation-based Recombination Operator to Node-depth Encoding
نویسندگان
چکیده
منابع مشابه
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In general, these problems are NP-Hard. In order to deal with the complexity of these problems, some alternative strategies have been proposed. Approaches using evolutionary algorithms have achieved relevant results. However...
متن کاملA Parallel Hardware Architecture based on Node-Depth Encoding to Solve Network Design Problems
Many problems involving network design can be found in the real world, such as electric power circuit planning, telecommunications and phylogenetic trees. In general, solutions for these problems are modeled as forests represented by a graph manipulating thousands or millions of input variables, making it hard to obtain the solutions in a reasonable time. To overcome this restriction, Evolution...
متن کاملHeuristic applied to the Euclidean Steiner tree problem with node-depth-degree encoding
In this paper a variation of the Beasley [1] algorithm for the Euclidean Steiner tree problem (ESTP) is presented. This variation uses the Node-Depth-Degree Encoding (NDDE), which requires an average time of O( √ n) in operations to generate and manipulate spanning forests. For spanning tree problems, this representation has linear time complexity when applied to network design problems with ev...
متن کاملTwo Permutation Classes related to the Bubble Sort Operator
We introduce the Dual Bubble Sort operator B̂ (a sorting algorithm such that, if σ = α 1β is a permutation, then B̂(σ) = 1α B̂(β)) and consider the set of permutations sorted by the composition B̂B, where B is the classical Bubble Sort operator. We show that this set is a permutation class and we determine the generating function of the descent and fixed point distributions over this class. Afterwa...
متن کاملAn Excellent Permutation Operator for Cryptographic Applications
Permutations are a core component of almost every cipher. No matter if we consider the DES [5], AES [2] or most of the other encryption algorithms [6] relevant nowadays, we always find permutation operators as essential building blocks inside. In this contribution we will introduce key-dependent permutation operators of provably excellent quality inspired by chaotic Kolmogorov flows [1, 4]. Fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.05.320